A tabu search approach to the truck scheduling problem with multiple docks and time windows
نویسندگان
چکیده
منابع مشابه
A tabu search approach to the truck scheduling problem with multiple docks and time windows
While organizing the cross-docking operations, cross-dock managers are confronted with many decision problems. One of these problems is the truck scheduling problem. This article presents a truck scheduling problem that is concerned with both inbound and outbound trucks at multiple dock doors. The objective is to minimize the total travel time and the total tardiness. The truck scheduling probl...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملA hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The ...
متن کاملA tabu search heuristic for the vehicle routing problem with time windows and split deliveries
In this paper, we consider the Vehicle Routing Problem with Time Windows and Split Deliveries (VRPTWSD) and present a solution method based on Tabu Search and four different neighborhood structures. This problem is an extension of the Vehicle Routing Problem, where the start of service at each customer must be within a time window, and a customer may be serviced by more than one vehicle. The he...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2013
ISSN: 0360-8352
DOI: 10.1016/j.cie.2013.09.024